Learning syntax by automata induction

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning by Distributed Automata

We introduce a slightly modiied version of a standard learning automaton and show that this`responsive' learning automata eliminates dominated strategies when playing against an unknown environment. This new automaton has strong convergence properties that are easily analyzed, allowing us to compute explicit bounds for convergence rates. Groups of such automata, interacting via a general game, ...

متن کامل

Learning Inference by Induction

This paper studies learning inference by induction. We first consider the problem of learning logical inference rules. Given a set S of propositional formulas and their logical consequences T , the goal is to find deductive inference rules that produce T from S. We show that an induction algorithm LF1T, which learns logic programs from interpretation transitions, successfully produces deductive...

متن کامل

Automata-Driven Automated Induction

This work investigates inductive theorem proving techniques for rst-order functions whose meaning and domains can be speciied by Horn Clauses built up from the equality and nitely many unary membership predicates. In contrast with other works in the area, constructors are not assumed to be free. Techniques originating from tree automata are used to describe ground constructor terms in normal fo...

متن کامل

Meaning Helps Learning Syntax

In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken into account, which seems cognitively relevant for the modeling of natural language learning. The syntactic formalism used is the one of Lambek categorial grammars and meaning is represented with logical formulas. The pr...

متن کامل

Learning Meaning Before Syntax

We present a simple computational model that takes into account semantics for languagelearning, as motivated by readings in the literature of children’s language acquisition and by adesire to incorporate a robust notion of semantics in the field of Grammatical Inference. Weargue that not only is it more natural to take into account semantics, but also that semanticinformation ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine Learning

سال: 1987

ISSN: 0885-6125,1573-0565

DOI: 10.1007/bf00058753